Balas E. An additive algorithm for solving linear programs with zero-one variables. Oper. Res. 13:517-46, 1965
نویسنده
چکیده
The additive algorithm was one of the early versions of the approach known as implicit enumeration or branch and bound. It solves a linear program in n 0-1 variables by systematically enumerating an (often small) subset of the 2” possible binary n-vectors, while using the logical implications of the 0-1 property to ensure that the whole set is implicitly examined. [The Science Citation Index® (SCI®) and the Social Sciences Citation Index® (SSCI®) indicate that this paper has been cited in over, 220 publications since 1%53
منابع مشابه
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. Weextend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programswith finitely many variables and infinitely many constraints. Applying projection leads to newcharacterizations of important properties for primal-dual pairs of semi-infinite programs suchas zero ...
متن کاملInverse conic programming with applications
Linear programming duality yields e,cient algorithms for solving inverse linear programs. We show that special classes of conic programs admit a similar duality and, as a consequence, establish that the corresponding inverse programs are e,ciently solvable. We discuss applications of inverse conic programming in portfolio optimization and utility function identi0cation. c © 2004 Elsevier B.V. A...
متن کاملSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
متن کاملLifting Gomory cuts with bounded variables
Recently, Balas and Qualizza introduced a new cut for mixed 0,1 programs, called lopsided cut. Here we present a family of cuts that comprises the Gomory mixed integer cut at one extreme and the lopsided cut at the other. We show that every inequality in this family is extreme for the appropriate infinite relaxation. We also show that these inequalities are split cuts. Finally we provide comput...
متن کاملBarrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
This study examines two different barrier functions and their use in both path-following and potential-reduction interior-point algorithms for solving a linear program of the form: minimize cTZ subject to Az = b and e < z < u, where components of e and u can be nonfinite, so the variables z can have 0-, 1-,or 2-sided bounds, j = 1, ..., n. The barrier functions that we study include an extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003